Logical error rate in the Pauli twirling approximation
نویسندگان
چکیده
منابع مشابه
Logical error rate in the Pauli twirling approximation
The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling ...
متن کاملEfficient error models for fault-tolerant architectures and the Pauli twirling approximation
The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical general-purpose method for constructing such an error model is to twirl a given completely positive channel over the Pauli basis, a procedure we refer to as the Pauli t...
متن کاملMinimum error discrimination of Pauli channels
Abstract. We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, differently from the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows to achieve the optimal discrimination. We also provide a simple neces...
متن کاملPauli Exchange and Quantum Error Correction
In many physically realistic models of quantum computation, Pauli exchange interactions cause a special type of two-qubit errors, called exchange errors, to occur as a first order effect of couplings within the computer. We discuss the physical mechanisms behind exchange errors and codes designed to explicitly deal with them.
متن کاملLogical approximation II
The paper continues a study of extensional formulas and their representation by normal forms. The notion of extensional formula is extended to the case when extensionality is considered with respect to a binary reflexive relation. It has been proved that extensional formulas can be represented by normal forms of infinite type and “approximated” by normal forms of finite type. All proofs are giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2015
ISSN: 2045-2322
DOI: 10.1038/srep14670